Parsing with Suux and Preex Dictionaries
نویسندگان
چکیده
We show that greedy left-to-right (right-to-left) parsing is optimal w.r.t. a suux (preex) dictionary. To exploit this observation, we show how to construct a static suux dictionary that supports on-line, linear-time optimal parsing. From this we derive an adaptive on-line method that yields compression comparing favorably to LZW.
منابع مشابه
Parsing with Su x and Pre x
We show that greedy left-to-right (right-to-left) parsing is optimal w.r.t. a suux (preex) dictionary. To exploit this observation, we show how to construct a static suux dictionary that supports on-line, linear-time optimal parsing. From this we derive an adaptive on-line method that yields compression comparing favorably to LZW.
متن کاملExtremal Innnite Overlap-free Binary Words
Let t be the innnite xed point, starting with 1, of the morphism : 0 ! 01, 1 ! 10. An innnite word over f0;1g is said to be overlap-free if it contains no factor of the form axaxa, where a 2 f0;1g and x 2 f0;1g. We prove that the lexicographically least innnite overlap-free binary word beginning with any speciied preex, if it exists, has a suux which is a suux of t. In particular, the lexicogra...
متن کاملIndexing for String Queries using
We present ve index trees designed for supporting string searches. We discuss Counted Trees, Substring Trees, and Regular Expression Trees, all of which suuer the same problem { their attempts at approximating a large set of data lead to an almost complete lack of information in the interior nodes. A variant of B-Trees, called a Preex-Suux Tree, avoids this diiculty by severely restricting the ...
متن کاملAn experimental study of SB-trees
In a previous work of ours 13], we proposed a text indexing data structure for external memory, which we called SB-tree, that combines the best B-tree and suux array qualities to overcome the limitations of inverted les, suux arrays, suux trees, and preex B-trees. In this paper, we study the performance of SB-trees in a practical setting by running a large number of searching and updating exper...
متن کاملLower Bounds for Constant Depth Circuits for Preex Problems, in Proc. of 10th International 5. Conclusion and Open Problems
Some doubly logarithmic parallel algorithms based on nding all nearest smaller values, Tech. Optimal doubly logarithmic parallel algorithms based on nding all nearest smaller values. Randomized range-maxima 21 Complexity of the preprocessing algorithm: O(I m (n)) time using n=I m (n) processors and O(n) space. Retrieval of a range-maximum query takes O(m) time using one processor. Theorem 4.1 a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996